Research on non-permeable packing materials. (II)
نویسندگان
چکیده
منابع مشابه
Egerváry Research Group on Combinatorial Optimization Packing Arborescences Packing Arborescences
In [7], Edmonds proved a fundamental theorem on packing arborescences that has become the base of several subsequent extensions. Recently, Japanese researchers found an unexpected further generalization which gave rise to many interesting questions about this subject [29], [20]. Another line of researches focused on covering intersecting families which generalizes Edmonds' theorems in a di eren...
متن کاملStudies on crystal semi-permeable membrane. II. On the formation of barium sulfate semi-permeable membrane.
The 1st report1) in a series of these studies, which was deduced from the report by Miyamoto and Takikawa2) that a precipitate of calcium silicate and magnesium silicate formed a semi-permeable membrane at the Pringsheim'a equilibrium point, recognized a formation of the so-called •hCrystal semi-permeable membrane•h also in a common water-insoluble salt (In this case, sodium carbonate and calci...
متن کاملPacking of compressible granular materials
3D computer simulations and experiments are employed to study random packings of compressible spherical grains under external confining stress. In the rigid ball limit, we find a continuous transition in which the stress vanishes as (straight phi-straight phi(c))(beta), where straight phi is the (solid phase) volume density. The value of straight phi(c) depends on whether the grains interact vi...
متن کاملOptimal Rectangle Packing on Non-Square Benchmarks
The rectangle packing problem consists of finding an enclosing rectangle of smallest area that can contain a given set of rectangles without overlap. We propose two new benchmarks, one where the orientation of the rectangles is fixed and one where it is free, that include rectangles of various aspect ratios. The new benchmarks avoid certain properties of easy instances, which we identify as ins...
متن کاملNote on non-uniform bin packing games
A non-uniform bin packing game is an N-person cooperative game, where the set N is defined by k bins of capacities b1, . . . , bk and n items of sizes a1, . . . , an. The objective function v of a coalition is the maximum total value of the items of that coalition which can be packed to the bins of that coalition. We investigate the taxation model of Faigle and Kern (1993) [2] and show that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sen'i Gakkaishi
سال: 1948
ISSN: 0037-9875,1884-2259
DOI: 10.2115/fiber.4.61